Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory
نویسندگان
چکیده
منابع مشابه
Formalising Exact Arithmetic in Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic à la Potts and Edalat [1]. We choose the constructive type theory as our formal verification tool. We discuss an extension of the constructive type theory with coinductive types that enables one to formalise and reason about the infinite objects. We show examples of how infinite objects such as streams and expre...
متن کاملConstructive Algebra in Type Theory
This thesis contains four papers aiming at bridging the gap between algorithms implemented in computer algebra systems and interactive proof assistants. This is done by implementing and verifying efficient algorithms using the Coq proof assistant together with the SSReflect extension. First there is a methodology, based on refinements, for linking implementations of algorithms using rich depend...
متن کاملArithmetic of Potts Model Hypersurfaces
We consider Potts model hypersurfaces defined by the multivariate Tutte polynomial of graphs (Potts model partition function). We focus on the behavior of the number of points over finite fields for these hypersurfaces, in comparison with the graph hypersurfaces of perturbative quantum field theory defined by the Kirchhoff graph polynomial. We give a very simple example of the failure of the “f...
متن کاملLecture 24 – Constructive Type Theory
By the 21st century, constructive type theory emerged as a unifying framework for logic, mathematics, and computer science. One of the prime movers was L.E.J. Brouwer who understood mathematics in terms of mental constructions and offered a novel account of both the logical operators and the basic mathematical entities such as natural numbers, real numbers, points, and spaces. His deep and orig...
متن کاملTECH REPORT: Trees in Constructive Type Theory
Trees are pervasive in the literature of data structures and algorithms. Every computer science undergraduate has an understanding of at least how trees function as part of their chosen field as well as their formation. The foundations of many abstract data types rely on trees and the ability to quickly and efficiently search and organize large data sets often seems to be wholly dependent on tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2007
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-006-1342-7